Analyzing square plate in diagonal compression using Beltrami-Michell methodology
نویسندگان
چکیده
منابع مشابه
Texture Map and Video Compression Using Beltrami Representation
Surface parameterizations and registrations are important in computer graphics and imaging, where 1-1 correspondences between meshes are computed. In practice, surface maps are usually represented and stored as three-dimensional coordinates each vertex is mapped to, which often requires lots of memory. This causes inconvenience in data transmission and data storage. To tackle this problem, we p...
متن کاملFolding the Square - Diagonal Lattice
We study the problem of " phantom " folding of the two-dimensional square lattice, in which the edges and diagonals of each face can be folded. The non-vanishing thermodynamic folding entropy per face s ≃ .2299(1) is estimated both analytically and numerically, by successively mapping the model onto a dense loop model, a spin model and a new 28 Vertex, 4-color model. Higher dimensional generali...
متن کاملFace Searching and Matching Using Gray Scale Diagonal Square Matrix
----------------------------------------------------------------------ABSTRACT-------------------------------------------------------------------This paper presents a novel approach in face digital image searching and matching. The given key image is converted into gray scale image and after that a matrix is computed with gray scale values of the key image. Then we are collecting the diagonal k...
متن کاملAnalyzing a psychiatric domain using KDSM methodology
A KDSM methodology for analyzing repeated very short-serial measures in a psychiatric ill-structured domain is introduced. This methodology is based on a combination of clustering based on rules with some Inductive Learning (Artificial Intelligence) and clustering (Statistics) techniques. This proposal focuses on results obtained on a real application of this kind of data, where common statisti...
متن کاملAnalyzing worms and network traffic using compression
Internet worms have become a widespread threat to system and network operations. In order to fight them more efficiently, it is necessary to analyze newly discovered worms and attack patterns. This paper shows how techniques based on Kolmogorov Complexity can help in the analysis of internet worms and network traffic. Using compression, different species of worms can be clustered by type. This ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical and Applied Mechanics
سال: 2015
ISSN: 1429-2955
DOI: 10.15632/jtam-pl.53.4.847